Problem Solvers

Groups of diverse problem solvers can outperform groups of high-ability problem solvers.

We introduce a general framework for modeling functionally diverse problem-solving agents. In this framework, problem-solving agents possess representations of problems and algorithms that they use to locate solutions. We use this framework to establish a result relevant to group composition. We find that when selecting a problem-solving team from a diverse population of intelligent agents, a t...

Collaborative Problem-Solving Between Optimistic and Pessimistic Problem Solvers

Robot Planning System Based on Problem Solvers

T h i s paper i s concerned w i t h a p l a n n i n g system f o r a r o b o t w i t h a hand and an eye w h i c h can m a n i p u l a t e b l o c k s . Two d i f f e r e n t k i n d s o f p r o b l e m s o l v e r s a r e used . One i s m a i n l y composed of a theorem p r o v e r based on t h e r e s o l u t i o n p r i n c i p l e , and the o t h e r c o n s i s t s o f a theorem p r o v e ...

Excel Solvers for the Traveling Salesman Problem

Ordering queries within a workload and ordering joins in a query are important problems in databases [1]. We give algorithms for the query sequencing problem that scale (small space) and are efficient (low runtime) as compared to earlier work [4]. The errors are small in practice and we are able to further reduce them using geometric repair. We provide a computational comparison of TSP solvers ...

Solving Packing Problem with Weaker Block Solvers

We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block solver ABS(p, ε/6, c) with price vector p, given accuracy ε and ratio c is required. In addition, in [Villavicencio and Grigoriadis, Network Optimization (1997)] a (1 + ε)approximation algorithm for standard packing pro...